Collapsing of Chaos in One Dimensional Maps

نویسندگان

  • Guocheng Yuan
  • James A. Yorke
چکیده

In their numerical investigation of the family of one dimensional maps f`(x) = 1 − 2|x|`, where ` > 2, Diamond et al. [P. Diamond et al., Physica D 86 (1999) 559–571] have observed the surprising numerical phenomenon that a large fraction of initial conditions chosen at random eventually wind up at −1, a repelling fixed point. This is a numerical artifact because the continuous maps are chaotic and almost every (true) trajectory can be shown to be dense in [−1, 1]. The goal of this paper is to extend and resolve this obvious contradiction. We model the numerical simulation with a randomly selected map. While they used 27 bit precision in computing f`, we prove for our model that this numerical artifact persists for an arbitrary high numerical prevision. The fraction of initial points eventually winding up at −1 remains bounded away from 0 for every numerical precision. ©2000 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Novel Chaos-Based Algorithms for Image and Video Watermarking

In this paper we introduce two innovative image and video watermarking algorithms. The paper’s main emphasis is on the use of chaotic maps to boost the algorithms’ security and resistance against attacks. By encrypting the watermark information in a one dimensional chaotic map, we make the extraction of watermark for potential attackers very hard. In another approach, we select embedding po...

متن کامل

GENERAL SYNCHRONIZATION OF COUPLED PAIR OF CHAOTIC ONE-DIMENSIONAL GAUSSIAN MAPS

In this paper we review some recent ideas of synchronization theory. We apply this theory to study the different synchronization aspects of uni-directionally coupled pair of chaotic one-dimensional Gaussian maps.

متن کامل

A chaos-based video watermarking algorithm

The intriguing characteristics of chaotic maps have prompted researchers to use these sequences in watermarking systems to good effect. In this paper we aim to use a tent map to encrypt the binary logo to achieve a like-noise signal. This approach makes extraction of the watermark signal by potential attacker very hard. Embedding locations are selected based on certain principles. Experimental ...

متن کامل

On generation of maximal-period pseudochaotic sequences obtained by discretized chaos maps

In this correspondence, a generation method of maximal-period pseudochaotic sequences obtained from discretized one dimensional chaos maps is theoretically shown, in which the relationship of discrete maps and transpositions plays a key role. From the method, a simple algorithm for generating a collection of maximal-period sequences obtained by a class of piecewise linear discretized chaos maps...

متن کامل

Border-Collision bifurcations in One-Dimensional Discontinuous Maps

We present a classification of border-collision bifurcations in one-dimensional discontinuous maps depending on the parameters of the piecewise linear approximation in the neighborhood of the point of discontinuity. For each range of parameter values we derive the condition of existence and stability of various periodic orbits and of chaos. This knowledge will help in understanding the bifurcat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999